Information-Theoretically Secure Three-Party Computation with One Active Adversary

نویسندگان

  • Ye Wang
  • Prakash Ishwar
  • Shantanu Rane
چکیده

A special three-party secure computation problem is studied in which one of three pairwise interacting parties is required to compute a function of the sequences held by the other two when one of the three parties may arbitrarily deviate from the computation protocol (active behavioral model). For this problem, information-theoretic conditions for secure computation are developed within the real versus ideal model simulation paradigm. Conditions for the passive behavioral model are also provided. A pure one-time-pad based protocol for securely computing the Hamming distance between binary sequences is developed and is shown, using the informationtheoretic security conditions, to be secure under both the active and passive behavioral models. In contrast, the general techniques of [1] and [2] require at least four parties when dealing with the active behavioral model. In particular, for the three-party problem considered herein, the BGW protocol that securely computes the squared l2 distance between sequences under the passive behavioral model is demonstrated to be insecure under the active behavioral model, even for binary sequences when the squared l2 distance coincides with the Hamming distance. Cornell University Library This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. Copyright c ©Mitsubishi Electric Research Laboratories, Inc., 2012 201 Broadway, Cambridge, Massachusetts 02139

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfectly-Secure MPC with Linear Communication Complexity

Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function, even when up to t players are under the control of an adversary. Known perfectly secure MPC protocols require communication of at least Ω(n) field elements per multiplication, whereas cryptographic or unconditional security is possible with communication linear in the number of players. We pre...

متن کامل

MPC vs. SFE : Unconditional and Computational Security

In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, passive, and fail corruption. The adversary’s corruption power is characterized by a so-called adversary structure which enumerates the adversary’s corruption options, each option being a triple (A, E, F ) of subsets of P , where...

متن کامل

Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries

We initiate the study of perfectly secure multiparty computation over asynchronous networks tolerating generalized adversaries. The classical results in information-theoretically secure asynchronous multiparty computation among n players state that less than n4 active adversaries can be tolerated in the perfect setting [4]. Strictly generalizing these results to the non-threshold setting, we sh...

متن کامل

General Adversaries in Unconditional Multi-party Computation

We consider a generalized adversary model for unconditionally secure multi-party computation. The adversary can actively corrupt (i.e. take full control over) a subset D P of the players, and, additionally , can passively corrupt (i.e. read the entire information of) another subset E P of the players. The adversary is characterized by a generalized adversary structure, i.e. a set of pairs (D; E...

متن کامل

Secure Multi-Party Computation from any Linear Secret Sharing Scheme

We present a general treatment of non-cryptographic (i.e. information-theoretically secure) multi-party computation, based on underlying linear secret sharing scheme. This general approach gives pure linear-algebra conditions on the linear mappings describing the scheme. The approach establishing the minimal conditions for security, can lead to design of more efficient Multi-Party Computation (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1206.2669  شماره 

صفحات  -

تاریخ انتشار 2012